Strong NP-Completeness of a Matrix Similarity Problem
نویسندگان
چکیده
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance 1, decide whether there exists a nonsingu-lar matrix G, with condition number bounded by , such that G ?1 AG is 22 block diagonal. This problem, which we shall refer to as DICHOTOMY, is an important one in the theory of invariant subspaces. It has recently been proved that DICHOTOMY is NP?complete. In this note we make some progress proving that DICHOTOMY is actually NP?complete in the strong sense. This outlines the \purely combinatorial" nature of the diiculty, which might well arise even in case of well scaled matrices with entries of small magnitude.
منابع مشابه
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions
We show that finding a global optimal solution for the regularized Lq-minimization problem (q ≥ 1) is strongly NP-hard if the penalty function is concave but not linear in a neighborhood of zero and satisfies a very mild technical condition. This implies that it is impossible to have a fully polynomial-time approximation scheme (FPTAS) for such problems unless P = NP. This result clarifies the ...
متن کاملGraph Similarity and Approximate Isomorphism
The graph similarity problem, also known as approximate graph isomorphism or graph matching problem, has been extensively studied in the machine learning community, but has not received much attention in the algorithms community: Given two graphs G,H of the same order n with adjacency matrices AG, AH , a well-studied measure of similarity is the Frobenius distance dist(G,H) := min π ‖AG −AH‖F ,...
متن کاملFormulation of Mobile Agent Allocation and its Strong NP-Completeness
We formally define the mobile agent allocation problem from a system-wide viewpoint and then prove that it is strongly NPcomplete even if each agent communicates only with two agents. This is the first formal definition for scheduling mobile agents from the viewpoint of load balancing, which enables us to discuss its properties on a rigorous basis. The problem is recognized as preemptive schedu...
متن کاملTesting membership in the {0, 1/2}-closure is strongly NP-hard, even for polytopes contained in the n-dimensional 0/1-cube
Caprara and Fischetti introduced a class of cutting planes, called {0, 1/2}-cuts, which are valid for arbitrary integer linear programs. They also showed that the associated separation problem is strongly NPhard. We show that separation remains strongly NP-hard, even when all integer variables are binary, even when the integer linear program is a set packing problem, and even when the matrix of...
متن کاملA Secure and Comparable Text Encryption Algorithm
This paper discloses a simple algorithm for encrypting text messages, based on the NP-completeness of the subset sum problem, such that the similarity between encryptions is roughly proportional to the semantic similarity between their generating messages. This allows parties to compare encrypted messages for semantic overlap without trusting an intermediary and might be applied, for example, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 165 شماره
صفحات -
تاریخ انتشار 1996